The N queens problem - new variants of the Wirth algorithm

The paper presents new ways of n-queens problem solving . Briefly, this is a problem on a nxn chessboard of a set n-queens, so that any two of them are not in check. At the beginning, currently used algorithm to find solutions is discussed. Then sequentially 4 new algorithms, along with the interpretation of changes are given. The research results, including comparison, of calculation times of all algorithms together with their interpretation are discussed. Finally, conclusions are given. The results were obtained thanks to the pre-created application. Chapters except for "By filtering ver. 2" were based on the previous studies carried out during the Bachelor course [1].